Error-correcting codes on low rank surfaces
نویسندگان
چکیده
منابع مشابه
Error-correcting codes on low rank surfaces
In this paper we construct some algebraic geometric error-correcting codes on surfaces whose Neron-Severi group has low rank. If the rank of the Neron-Severi group is 1, the intersection of this surface with an irreducible surface of lower degree will be an irreducible curve, and this makes possible the construction of codes with good parameters. Rank 1 surfaces are not easy to find, but we are...
متن کاملError Correcting Codes on Algebraic Surfaces
Lomont, Chris C.. Ph.D., Purdue University, May, 2003. Error Correcting Codes on Algebraic Surfaces. Major Professor: Tzuong-Tsieng Moh. Error correcting codes are defined and important parameters for a code are explained. Parameters of new codes constructed on algebraic surfaces are studied. In particular, codes resulting from blowing up points in P are briefly studied, then codes resulting fr...
متن کاملHirzebruch Surfaces and Error-correcting Codes
For any integral convex polytope in R there is an explicit construction of an error-correcting code of length (q 1) over the nite eld Fq , obtained by evaluation of rational functions on a toric surface associated to the polytope. The dimension of the code is equal to the number of integral points in the given polytope and the minimumdistance is estimated using the cohomology and intersection t...
متن کاملOne-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes
We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...
متن کاملRank error-correcting pairs
Error-correcting pairs were introduced independently by Pellikaan and Kötter as a general method of decoding linear codes with respect to the Hamming metric using coordinatewise products of vectors, and are used for many well-known families of codes. In this paper, we define new types of vector products, extending the coordinatewise product, some of which preserve symbolic products of linearize...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Finite Fields and Their Applications
سال: 2007
ISSN: 1071-5797
DOI: 10.1016/j.ffa.2007.05.001